Safra, Muli: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Hardness Amplification for Errorless Heuristics

Bogdanov, Andrej, Safra, Muli

Year:

2007

Language:

english

File:

PDF, 286 KB

english, 2007

2

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

Austrin, Per, Khot, Subhash, Safra, Muli

Year:

2009

Language:

english

File:

PDF, 313 KB

english, 2009

3

[ACM Press the 50th Annual ACM SIGACT Symposium - Los Angeles, CA, USA (2018.06.25-2018.06.29)] Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 - Towards a proof of the 2-to-1 games conjecture?

Dinur, Irit, Khot, Subhash, Kindler, Guy, Minzer, Dor, Safra, Muli

Year:

2018

Language:

english

File:

PDF, 960 KB

english, 2018

4

[ACM Press the 49th Annual ACM SIGACT Symposium - Montreal, Canada (2017.06.19-2017.06.23)] Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 - On independent sets, 2-to-2 games, and Grassmann graphs

Khot, Subhash, Minzer, Dor, Safra, Muli

Year:

2017

Language:

english

File:

PDF, 882 KB

english, 2017

5

[IEEE 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2015.10.17-2015.10.20)] 2015 IEEE 56th Annual Symposium on Foundations of Computer Science - On Monotonicity Testing and Boolean Isoperimetric Type Theorems

Khot, Subhash, Minzer, Dor, Safra, Muli

Year:

2015

Language:

english

File:

PDF, 200 KB

english, 2015

6

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - A Two Prover One Round Game with Strong Soundness

Khot, Subhash, Safra, Muli

Year:

2011

Language:

english

File:

PDF, 491 KB

english, 2011

7

On Monotonicity Testing and Boolean Isoperimetric-type Theorems

Khot, Subhash, Minzer, Dor, Safra, Muli

Journal:

SIAM Journal on Computing

Year:

2018

Language:

english

File:

PDF, 583 KB

english, 2018

8

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

Dinur, Irit, Khot, Subhash, Perkins, Will, Safra, Muli

Year:

2010

Language:

english

File:

PDF, 448 KB

english, 2010

9

Towards a Proof of the Fourier-Entropy Conjecture?

Kelman, Esty, Kindler, Guy, Lifshitz, Noam, Minzer, Dor, Safra, Muli

Journal:

Geometric And Functional Analysis

Year:

2020

File:

PDF, 653 KB

2020

10

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Hardness Amplification for Errorless Heuristics

Bogdanov, Andrej, Safra, Muli

Year:

2007

Language:

english

File:

PDF, 286 KB

english, 2007

11

Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity

Ron, Dana, Rubinfeld, Ronitt, Safra, Muli, Samorodnitsky, Alex, Weinstein, Omri

Journal:

ACM Transactions on Computation Theory

Year:

2012

Language:

english

File:

PDF, 133 KB

english, 2012

12

[ACM Press the 4th conference - Berkeley, California, USA (2013.01.09-2013.01.12)] Proceedings of the 4th conference on Innovations in Theoretical Computer Science - ITCS '13 - Towards an optimal query efficient PCP?

Khot, Subhash, Safra, Muli, Tulsiani, Madhur

Year:

2013

Language:

english

File:

PDF, 739 KB

english, 2013

13

[ACM Press the 50th Annual ACM SIGACT Symposium - Los Angeles, CA, USA (2018.06.25-2018.06.29)] Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 - On non-optimally expanding sets in Grassmann graphs

Dinur, Irit, Khot, Subhash, Kindler, Guy, Minzer, Dor, Safra, Muli

Year:

2018

Language:

english

File:

PDF, 907 KB

english, 2018

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски